Controlling Free Riding using Extended Point Based Incentive Mechanism in Peer-to-Peer Networks

نویسندگان

  • Bikash Upadhyay
  • Shraddha Dixit
چکیده

Over the years of the emergence of peer-to-peer systems a phenomenon named ‘Free Riding’ has affected its performance and become a serious threat to be resolved. Free riding phenomenon was first felt in the study of Gnutella. As the number of free riders increases, the performance of the overall system decreases as free riders use resources without giving anything to the system. To solve the problem of free riding we have developed an Extended Point Based Incentive Mechanism (EPBIM) through which the users are given some incentives to share some files into the system. Our scheme attracts the users to share more and more as it gives more points to the users which provide responses for some queries of other users in the system. This scheme is different from other incentive based schemes in the way that it uses some new parameters for incentives like the time user spends in the network, upload speed of the user, how many simultaneous uploads a user is providing, how many query responses a user is giving and query forwarding of other users in the network. Our simulation results show that this scheme reduces the percentage of free riders to a great extent therefore increasing the performance of a peer-to-peer network.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incentive Schemes for Mobile Peer-to-Peer Systems and Free Riding Problem: A Survey

Mobile peer-to-peer networks are quite prevalent and popular now days due to advent of business scenarios where all the services are going mobile like whether it's to find good restaurants, healthy diet books making friends, job-hunting, real state info or cab-sharing etc. As the mobile users are increasing day by day, peer-to-peer networks getting bigger and complex. In contrast to client serv...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

A Grade-Based Incentive Mechanism for Peer-to-Peer Networks

Free-riding is a desperate and a constant menace to many P2P systems, to violate the cooperation among peers. This study proposes a grade-based approach, which expeditiously maintains fairness in the network by encouraging the high contributed peers and altogether wiping out the free-riders. The Network Contribution Ratio determines the contribution of users globally. Besides, the proposed grad...

متن کامل

A Novel Caching Strategy in Video-on-Demand (VoD) Peer-to-Peer (P2P) Networks Based on Complex Network Theory

The popularity of video-on-demand (VoD) streaming has grown dramatically over the World Wide Web. Most users in VoD P2P networks have to wait a long time in order to access their requesting videos. Therefore, reducing waiting time to access videos is the main challenge for VoD P2P networks. In this paper, we propose a novel algorithm for caching video based on peers' priority and video's popula...

متن کامل

Incentive Mechanisms for Agent-Based Peer-to-Peer Systems

Most of the existing research in peer-to-peer systems focuses on protocol design and doesn’t consider the rationality of each peer. One phenomenon that should not be ignored is free riding. Some peers simply consume system resources but contribute nothing to the system. In this paper we present an agentbased peer-to-peer system, in which each peer is a software agent and the agents cooperate to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012